Parallelizing Kernel Polynomial Method Applying Graphics Processing Units
نویسندگان
چکیده
منابع مشابه
Parallelizing Kernel Polynomial Method Applying Graphics Processing Units
The Kernel Polynomial Method (KPM) is one of the fast diagonalization methods used for simulations of quantum systems in research fields of condensed matter physics and chemistry. The algorithm has a difficulty to be parallelized on a cluster computer or a supercomputer due to the fine-grain recursive calculations. This paper proposes an implementation of the KPM on the recent graphics processi...
متن کاملHermite Polynomial Characterization of Heartbeats with Graphics Processing Units
In this paper we address the massive parallelization of the characterization of heartbeats by means of Graphics Processors. Heartbeats are represented with Hermite polynomials due to the compactness and robustness of this representation. Both the off-line and on-line characterization of QRS complexes are covered, thus, assessing the capabilities of Graphics Processors for these tasks. The resul...
متن کاملAccelerating the Gillespie t-Leaping Method Using Graphics Processing Units
The Gillespie t-Leaping Method is an approximate algorithm that is faster than the exact Direct Method (DM) due to the progression of the simulation with larger time steps. However, the procedure to compute the time leap t is quite expensive. In this paper, we explore the acceleration of the t-Leaping Method using Graphics Processing Unit (GPUs) for ultra-large networks (w0:5e reaction channels...
متن کاملAccelerating the Gillespie τ-Leaping Method Using Graphics Processing Units
The Gillespie τ-Leaping Method is an approximate algorithm that is faster than the exact Direct Method (DM) due to the progression of the simulation with larger time steps. However, the procedure to compute the time leap τ is quite expensive. In this paper, we explore the acceleration of the τ-Leaping Method using Graphics Processing Unit (GPUs) for ultra-large networks (>0.5e(6) reaction chann...
متن کاملCofactorization on Graphics Processing Units
We show how the cofactorization step, a compute-intensive part of the relation collection phase of the number field sieve (NFS), can be farmed out to a graphics processing unit. Our implementation on a GTX 580 GPU, which is integrated with a state-of-the-art NFS implementation, can serve as a cryptanalytic co-processor for several Intel i7-3770K quad-core CPUs simultaneously. This allows those ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Networking and Computing
سال: 2012
ISSN: 2185-2839,2185-2847
DOI: 10.15803/ijnc.2.1_41